Gross substitution, discrete convexity, and submodularity

نویسندگان

  • Vladimir I. Danilov
  • Gleb A. Koshevoy
  • C. Lang
چکیده

We consider a class of functions satisfying the gross-substitutes property (GS-functions). We show that GS-functions are concave functions, whose parquets are constituted by quasipolymatroids. The class of conjugate functions to GS-functions turns out to be the class of polyhedral supermodular functions. The class of polyhedral GS-functions is a proper subclass of the class of polyhedral submodular functions. PM-functions, concave functions whose parquets are constituted by g-polymatroids, form a proper subclass of the class of GS-functions. We provide an additional characterization of PM-functions. ? 2003 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Substitutes and complements in network flows viewed as discrete convexity

A new light is shed on “substitutes and complements” in the maximum weight circulation problem with reference to the concepts of L-convexity and M-convexity in the theory of discrete convex analysis. This provides us with a deeper understanding of the relationship between convexity and submodularity in combinatorial optimization.

متن کامل

Discrete Convexity for Multiflows and 0-extensions

This paper addresses an approach to extend the submodularity and L-convexity concepts to more general structures than integer lattices. The main motivations are to give a solution of the tractability classification in the minimum 0-extension problem and to give a discrete-convex-analysis view to combinatorial multiflow dualities.

متن کامل

Polyhedral aspects of Submodularity, Convexity and Concavity

The seminal work by Edmonds [9] and Lovász [39] shows the strong connection between submodular functions and convex functions. Submodular functions have tight modular lower bounds, and a subdifferential structure [16] in a manner akin to convex functions. They also admit polynomial time algorithms for minimization and satisfy the Fenchel duality theorem [18] and the Discrete Seperation Theorem ...

متن کامل

Discrete Midpoint Convexity

For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of the line segment. Midpoint convexity is a well-known characterization of ordinary convexity under very mild assumptions. For a function defined on the integer...

متن کامل

Several Aspects of Antimatroids and Convex Geometries Master's Thesis

Convexity is important in several elds, and we have some theories on it. In this thesis, we discuss a kind of combinatorial convexity, in particular, antimatroids and convex geometries. An antimatroid is a combinatorial abstraction of convexity. It has some di erent origins; by Dilworth in lattice theory, by Edelman and Jamison in the notions of convexity, by Korte{Lov asz who were motivated by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 131  شماره 

صفحات  -

تاریخ انتشار 2003